Parallel, Asynchronous and Decentralised Ant Colony System
نویسندگان
چکیده
This paper describes a multi-agent system architecture that would permit implementing an established and successful nature-inspired algorithm, Ant Colony System (ACS), in a parallel, asynchronous and decentralised environment. We reviewACS, highlighting the obstacles to its implementation in this sort of environment. It is suggested how these obstacles may be overcome using a pheromone infrastructure and some modifications to the original algorithm. The possibilities opened up by this implementation are discussed with reference to an elitist ant strategy. Some related exploratory work is reported.
منابع مشابه
Moving Nature-Inspired Algorithms to Parallel, Asynchronous and Decentralised Environments
This paper motivates research into implementing nature-inspired algorithms in decentralised, asynchronous and parallel environments. These characteristics typify environments such as Peer-To-Peer systems, the Grid and autonomic computing which demand robustness, decentralisation, parallelism, asynchronicity and self-organisation. Nature-inspired systems promise these properties. However, curren...
متن کاملSpecial issue on Nature-inspired systems for parallel, asynchronous and decentralised environments
Nature-inspired algorithms such as genetic algorithms, particle swarm optimisation and ant colony algorithms are the state-of-the-art solution technique for some problems. Furthermore, their populationbased stochastic search approach promises desirable algorithm features such as anytime decentralised solution and robustness to problem change. However, the efficient pursuit of more accurate solu...
متن کاملA roadmap of nature-inspired systems research and development
Nature-inspired algorithms such as genetic algorithms, particle swarm optimisation and ant colony algorithms have successfully solved computer science problems of search and optimisation. The initial implementations of these techniques focused on static problems solved on single machines. These have been extended by adding parallelisation capabilities in the vein of distributed computing with a...
متن کاملParallel Ant Colony Optimization Algorithm on a Multi-core Processor
This paper proposes parallelization methods of ACO algorithms on a computing platform with a multi-core processor aiming at fast execution to find acceptable solutions. As an ACO algorithm, we use the cunning Ant System and test on several sizes of TSP instances. As the parallelization method, we use agent level parallelization in one colony using Java thread programming. According to the synch...
متن کاملAn Improved Parallel Ant Colony Optimization Based on Message Passing Interface
Ant Colony Optimization (ACO) is recently proposed metaheuristic approach for solving hard combinatorial optimization problems. Parallel implementation of ACO can reduce the computational time obviously. An improved parallel ACO algorithm is proposed in this paper, which use dynamic transition probability to enlarge the search space by stimulating ants choosing new path at early stage; use poly...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006